Quasi-Dyadic CFS Signatures
نویسندگان
چکیده
Courtois-Finiasz-Sendrier (CFS) digital signatures critically depend on the ability to efficiently find a decodable syndrome by random sampling the syndrome space, previously restricting the class of codes upon which they could be instantiated to generic binary Goppa codes. In this paper we show how to construct t-error correcting quasi-dyadic codes where the density of decodable syndromes is high, while also allowing for a reduction by a factor up to t in the key size.
منابع مشابه
Improved Identity-Based Identification and Signature Schemes Using Quasi-Dyadic Goppa Codes
In this paper, we present an improved version of an identity-based identification scheme based on error-correcting codes. Our scheme combines the Courtois-Finiasz-Sendrier signature scheme using quasi-dyadic codes (QD-CFS) proposed in [2] and the identification scheme by Stern [18]. Following the construction proposed in [5], we obtain an identity-based identification scheme which has the advan...
متن کاملFlexible Quasi-Dyadic Code-Based Public-Key Encryption and Signature
Drawback of code-based public-key cryptosystems is that their publickey size is lage. It takes some hundreds KB to some MB for typical parameters. While several attempts have been conducted to reduce it, most of them have failed except one, which is Quasi-Dyadic (QD) public-key (for large extention degrees). While an attack has been proposed on QD public-key (for small extension degrees), it ca...
متن کاملParallel-CFS - Strengthening the CFS McEliece-Based Signature Scheme
This article presents a modification of the CFS code based signature scheme. By producing two (or more generally i) signatures in parallel, we show that it is possible to protect this scheme from “one out of many” decoding attacks. With this modification, and at the cost of slightly larger signatures, it is possible to use smaller parameters for the CFS signature, thus making this new Parallel-...
متن کاملIs There a Monadic as well as a Dyadic Bayesian Logic? Two Logics Explaining Conjunction 'Fallacies'
Formal logic and probability theory are often considered the most fundamental norms of rational thought, but their application to psychological tasks has raised serious doubts about human rationality. A central finding is that people sometimes judge the probability of a conjunction to be higher than that of its conjuncts (conjunction fallacies, CFs). Bayesian logic (BL, von Sydow, 2011) formali...
متن کاملDistinct plasma immune signatures in ME/CFS are present early in the course of illness
Myalgic encephalomyelitis/chronic fatigue syndrome (ME/CFS) is an unexplained incapacitating illness that may affect up to 4 million people in the United States alone. There are no validated laboratory tests for diagnosis or management despite global efforts to find biomarkers of disease. We considered the possibility that inability to identify such biomarkers reflected variations in diagnostic...
متن کامل